Intelligent university timetable scheduling system using sudoku grid with magic square

نویسندگان

چکیده

Examination timetabling is problem faced by many academic educational institutions. The situation formulated as artificial intelligence problems Sudoku grid with Magic square. Problem assigning a set of examinations to fixed number examination periods so that no student required take more than one at time. research describes two proposed heuristic algorithms create university and avoiding the overlapping exams. We algorithms, first algorithm based on grid, hard constraints well soft are proposed. assigned exams 9 period 27 slot times 3 rooms, classes. Each in each class takes While, second simulates classic manual methods while observing problem. approach used further optimize result include soft. methodology for creating Exam has been implemented Matlab closing gap between classical intelligent methods. results obtained very less computational effort through algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Agent System for University Course Timetable Scheduling

Many real-world applications are mapped into combinatorial problems. An example of such problem is timetable scheduling. In this case, the two basic characteristics can be defined by its distributed and dynamic environment. One efficient solution could be provided by an agent-based approach. A timetable scheduling problem can be modelled as a multi-agent system that provides the final schedule ...

متن کامل

Towards an Intelligent Grid Scheduling System

The main objective of the Intelligent GRID Scheduling System (ISS) project is to provide a middleware infrastructure allowing a good positioning and scheduling of real life applications in a computational GRID. According to data collected on the machines in the GRID, on the behaviour of the applications, and on the performance requirements demanded by the user, a heuristic cost function is eval...

متن کامل

Modular magic sudoku

A modular magic sudoku solution is a sudoku solution with symbols in {0, 1, ..., 8} such that rows, columns, and diagonals of each subsquare add to zero modulo nine. We count these sudoku solutions by using the action of a suitable symmetry group and we also describe maximal mutually orthogonal families.

متن کامل

Magic Squares and Sudoku

We introduce a family of magic squares, called linear magic squares, and show that any parallel linear sudoku solution of sufficiently large order can be relabeled so that all of its subsquares are linear magic. As a consequence, we show that if n has prime factorization p1 1 · · · p kt t and q = min{p k j j | 1 ≤ j ≤ t}, then there is a family of q(q − 1) mutually orthogonal magic sudoku solut...

متن کامل

Applying Constraint Satisfaction Technique in University Timetable Scheduling

Planning and scheduling are often NP-complete problems. There have been different approaches to tackle these problems. With the emergence of constraint logic programming, the constraint satisfaction approach has started to attract attention due to its effectness in solving these real-life problems. In this paper, we report our experience of applying constraint logic programming to fully automat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of Electrical Engineering and Informatics

سال: 2022

ISSN: ['2302-9285']

DOI: https://doi.org/10.11591/eei.v11i3.3694